A-priori upper bounds for the set covering problem
نویسندگان
چکیده
منابع مشابه
A Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملa local branching approach for the set covering problem
the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملNew upper bounds for binary covering codes
Improved upper bounds are presented for K(n, r), the minimum cardinality of a binary code of length n and coveting radius r. The new bounds are obtained by both new and old constructions; in many of these, computer search using simulated annealing and tabu search plays a central role. Some new linear coveting codes are also presented. An updated table of upper bounds on K(n,r), n~<64, r~<12, is...
متن کاملUpper Bounds for Covering Designs by SimulatedAnnealingKari
A t ? (v; m; k;) covering design is a pair (X; A), where X is a set of v elements (called points) and A is a multiset of k-subsets of X (called blocks), such that every m-subset of X intersects at least members of A in at least t points. It is required that v k t and v m t. Such a covering design gives an upper bound on C (v; m; k; t), the number of blocks in a minimal t ? (v; m; k;) covering d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2015
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-015-2069-0